The "Automatic" Robustness of Minimum Distance Functionals
نویسندگان
چکیده
منابع مشابه
The minimum barrier distance
In this paper we introduce a minimum barrier distance, MBD, defined for the (graphs of) real-valued bounded functions fA, whose domain D is a compact subsets of the Euclidean space R. The formulation of MBD is presented in the continuous setting, where D is a simply connected region in R, as well as in the case where D is a digital scene. The MBD is defined as the minimal value of the barrier s...
متن کاملDistribution of minimum values of stochastic functionals
Some mathematical problems of mechanics and physics have a form of the following variational problem. There is a functional, I, which is a sum of some quadratic positive functional and a linear functional. The quadratic functional is deterministic. The linear functional is a sum of a large number, N , of statistically independent linear functionals. The minimum value of the functional, I; is ra...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملMinimum distance and the minimum weight codewords of Schubert codes
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by Xiang. We give an alternative proof of this formula. Further, we propose a characterization of the minimum weight codewords of Schubert codes by introducing the n...
متن کاملA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1988
ISSN: 0090-5364
DOI: 10.1214/aos/1176350820